|
In mathematical optimization, Wolfe duality, named after Philip Wolfe, is type of dual problem in which the objective function and constraints are all differentiable functions. Using this concept a lower bound for a minimization problem can be found because of the weak duality principle. == Mathematical formulation == For a minimization problem with inequality constraints, : the Lagrangian dual problem is : where the objective function is the Lagrange dual function. Provided that the functions and are continuously differentiable, the infimum occurs where the gradient is equal to zero. The problem : is called the Wolfe dual problem. This problem employs the KKT conditions as a constraint. This problem may be difficult to deal with computationally, because the objective function is not concave in the joint variables . Also, the equality constraint is nonlinear in general, so the Wolfe dual problem is typically a nonconvex optimization problem. In any case, weak duality holds. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Wolfe duality」の詳細全文を読む スポンサード リンク
|